A coding theorem for secret sharing communication systems with two Gaussian wiretap channels
نویسنده
چکیده
A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWC’s is described by the capacities and secrecy capacities of two GWC’s.
منابع مشابه
Wiretap Channels: Nonasymptotic Fundamental Limits
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact secondorder...
متن کاملAchievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملCoding theorem for secret sharing communication systems with two noisy channels
The coding theorem is proved for the secret sharing communication system (SSCS) with two noisy channels, each of which is a broadcast channel characterized by P( y,z, Ix,), j = 1,2; it is assumed that the legitimate channel ( Xj + Y,) is less noisy than the wiretapped channel ( Xj --f Z,), The code (f, +) for the SSCS is defined by two mappings: (Xp,Xp)=f(SK,T) and s^=q5(Yp,YaNz) where 7’ is an...
متن کاملEnhancing Secrecy Rate Region for Recent Messages for a Slotted Multiple Access Wiretap Channel to Shannon Capacity Region
Security constraint results in rate-loss in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme ...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 37 شماره
صفحات -
تاریخ انتشار 1991